#ifndef TNVISIT_H
#define TNVISIT_H

#include "graph.h"

struct visit_result{
 int visited_nodes;
 uint last_node;
 int eccentricity;

};


extern int visits;
extern int bestvisit;
extern int maxvisits;

extern uint visit(struct tngraph*g, int* res, uint fns, const uint *firstnodes, uchar*marks, uint*tree, struct visit_result * vres, const uint*in_tree);

extern uint highestindex(uint s, int*a);
extern uint highestnonvisitedindex(uint s, int*a, unsigned char*marks);
extern int arraymax(uint size, int*array);
extern void findgigantandkill(struct tngraph*g);
extern void il(int nl);
extern void iu(int nu);

#endif
